Anytime Planning For Agent Behaviour
نویسنده
چکیده
For an agent to act successfully in a complex and dynamic environment (such as a computer game) it must have a method of generating future behaviour that meets the demands of its environment. One such method is anytime planning. This paper discusses the problems and benefits associated with making a planning system work under the anytime paradigm, and introduces AnytimeUMCP (A-UMCP), an anytime version of the UMCP hierarchical task network (HTN) planner [Erol, 1995]. It also covers the necessary abilities an agent must have in order to execute plans produced by an anytime hierarchical task network planner.
منابع مشابه
An Anytime Planning Agent For Computer Game Worlds
Computer game worlds are dynamic and operate in realtime. Any agent in such a world must utilize techniques that can deal with these environmental factors. Additionally, to advance past the current state-of-the-art, computer game agents must display intelligent goalorientated behaviour. Traditional planners, whilst ful lling the need to generate intelligent, goal-orientated behaviour, fail dram...
متن کاملEnhancing the Anytime Behaviour of Mixed CSP-Based Planning
An algorithm with the anytime property has an approximate solution always available; and the longer the algorithm runs, the better the solution becomes. Anytime planning is important in domains such as aerospace, where time for reasoning is limited and a viable (if suboptimal) course of action must be always available. In this paper we study anytime solving of a planning problem under uncertain...
متن کاملAn UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain an anytime planner that provides partial plans before finding a solution plan, and fu...
متن کاملReal Time Goal Orientated Behaviour for Computer Game Agents
To increase the depth and appeal of computer games, the intelligence of the characters they contain needs to be increased. These characters should be played by intelligent agents that are aware of how goals can be achieved and reasoned about. Existing AI methods struggle in the computer game domain because of the real-time response required from the algorithms and restrictive processor availabi...
متن کاملDecentralized monitoring of distributed anytime algorithms
Anytime algorithms allow a system to trade solution quality for computation time. In previous work, monitoring techniques have been developed to allow agents to stop the computation at the “right” time so as to optimize a given time-dependent utility function. However, these results apply only to the single-agent case. In this paper we analyze the problems that arise when several agents solve c...
متن کامل